solving a robust capacitated arc routing problem using a hybrid simulated annealing algorithm: a waste collection application

نویسندگان

e. babaee tirkolaee

department of industrial engineering, mazandaran university of science and technology, babol, iran. m. alinaghian

department of industrial eengineering, isfahan university of technology, isfahan, iran. m. bakhshi sasi

department of industrial eengineering, isfahan university of technology, isfahan, iran. m. m. seyyed esfahani

department of industrial engineering, mazandaran university of science and technology, babol, iran.

چکیده

the urban waste collection is one of the major municipal activities that involves large expenditures and difficult operational problems. also, waste collection and disposal have high expenses such as investment cost (i.e. vehicles fleet) and high operational cost (i.e. fuel, maintenance). in fact, making slight improvements in this issue lead to a huge saving in municipal consumption. some incidents such as altering the pattern of waste collection and abrupt occurrence of events can cause uncertainty in the precise amount of waste easily and consequently, data uncertainty arises.  in this paper, a novel mathematical model is developed for robust capacitated arc routing problem (carp). the objective function of the proposed model aims to minimize the traversed distance according to the demand uncertainty of the edges. to solve the problem, a hybrid metaheuristic algorithm is developed based on a simulated annealing algorithm and a heuristic algorithm. moreover, the results obtained from the proposed algorithm are compared with the results of exact method in order to evaluate the algorithm efficiency. the results have shown that the performance of the proposed hybrid metaheuristic is acceptable.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solving a robust capacitated arc routing problem using a hybrid simulated annealing algorithm: A waste collection application

The urban waste collection is one of the major municipal activities that involves large expenditures and difficult operational problems. Also, waste collection and disposal have high expenses such as investment cost (i.e. vehicles fleet) and high operational cost (i.e. fuel, maintenance). In fact, making slight improvements in this issue lead to a huge saving in municipal consumption. Some inci...

متن کامل

A hybrid metaheuristic algorithm for solving a rollon–rolloff waste collection vehicle routing problem considering waste separation and recycling center

This paper addresses a rollon–rolloff waste collection vehicle routing problem which involves large containers that collect huge amounts of waste from construction sites and shopping malls. In this problem, vehicles could only move one container at a time between customers’ locations, a depot, a disposal center, and a recycling center site. Other than a disposal center, a recycling ...

متن کامل

A new Simulated Annealing algorithm for the robust coloring problem

The Robust Coloring Problem (RCP) is a generalization of the well-known Graph Coloring Problem where we seek for a solution that remains valid when extra edges are added. The RCP is used in scheduling of events with possible last-minute changes and study frequency assignments of the electromagnetic spectrum. This problem has been proved as NP-hard and in instances larger than 30 vertices, meta-...

متن کامل

Capacitated Windy Rural Postman Problem with Several Vehicles: A Hybrid Multi-Objective Simulated Annealing Algorithm

This paper presents the capacitated Windy Rural Postman Problem with several vehicles. For this problem, two objectives are considered. One of them is the minimization of the total cost of all vehicle routes expressed by the sum of the total traversing cost and another one is reduction of the maximum cost of vehicle route in order to find a set of equitable tours for the vehicles. Mathematical ...

متن کامل

A hybrid metaheuristic algorithm for the robust pollution-routing problem

Emissions resulted from transportation activities may lead to dangerous effects on the whole environment and human health. According to sustainability principles, in recent years researchers attempt to consider the environmental burden of logistics activities in traditional logistics problems such as vehicle routing problems (VRPs). The pollution-routing problem (PRP) is an extension of the VRP...

متن کامل

Solving a bi-objective location routing problem by a NSGA-II combined with clustering approach: application in waste collection problem

It is observed that the separated design of location for depots and routing for servicing customers often reach a suboptimal solution. So, solving location and routing problem simultaneously could achieve better results. In this paper, waste collection problem is considered with regard to economic and societal objective functions. A non-dominated sorting genetic algorithm (NSGA-II) is used to l...

متن کامل

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید


عنوان ژورنال:
journal of industrial engineering and management studies

جلد ۳، شماره ۱، صفحات ۶۱-۷۶

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023